Analysing reward measures of LARES performability models by discontinuous Markov chains
نویسندگان
چکیده
This paper presents a new method for specifying and analysing Markovian performability models. An extension of the LARES modelling language is considered which offers both delayed and immediate transitions, as well as rate and impulse rewards on whose basis different types of reward measures can be defined. The paper describes the evaluation path, starting from the modular and hierarchical LARES description and leading via a flat labelled transition system to the underlying stochastic model. The latter is a continuoustime Markov chain with fast transitions which, by taking the limit of the fast transition rates, can be interpreted as a CTMC with stochastic discontinuities. Finally, by continuisation of impulse rewards and an aggregation process, a standard Markov reward model is obtained.
منابع مشابه
Third International Conference on Performance of Distributed Systems and Integrated Communication Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets. 5.3.2 Non-homogeneous Ctmcs 5.2.1 Stiness Avoidance 5.2.2 Stiness Tolerance
In this tutorial, we discuss several practical issues regarding speci cation and solution of dependability and performability models. We compare model types with and without rewards. Continuous-time Markov chains (CTMCs) are compared with (continuous-time) Markov reward models (MRMs) and generalized stochastic Petri nets (GSPNs) are compared with stochastic reward nets (SRNs). It is shown that ...
متن کاملAutomated Performance and Dependability Evaluation Using Model Checking
Markov chains (and their extensions with rewards) have been widely used to determine performance, dependability and performability characteristics of computer communication systems, such as throughput, delay, mean time to failure, or the probability to accumulate at least a certain amount of reward in a given time. Due to the rapidly increasing size and complexity of systems, Markov chains and ...
متن کاملModel Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formally-specified system. In recent years, we have extended CTL such that it allows for the specification of properties over finite-state continuous-time Markov chains (CTMCs). Computational techniques for model chec...
متن کاملOn the Logical Characterisation of Performability Properties
Markov-reward models, as extensions of continuous-time Markov chains, have received increased attention for the specification and evaluation of performance and dependability properties of systems. Until now, however, the specification of reward-based performance and dependability measures has been done manually and informally. In this paper, we change this undesirable situation by the introduct...
متن کاملDependability and Performability Analysis
In this tutorial, we discuss several practical issues regarding specification and solution of dependability and performability models. We compare model types with and without rewards. Continuous-time Markov chains (CTMCs) are compared with (continuous-time) Markov reward models (MRMs) and generalized stochastic Petri nets (GSPNs) are compared with stochastic reward nets (SRNs). It is shown that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJCCBS
دوره 7 شماره
صفحات -
تاریخ انتشار 2017